Range aggregate structures for colored geometric objects
نویسندگان
چکیده
A set of n colored objects (points/hyperboxes) lie in IR and given a query orthogonal range q, we need to report the distinct colors of the objects in S ∩ q. In a scenarto where these colored objects also come associated with a weight, for each distinct color c of the objects in S ∩ q, the tuple < c, F(c) > where F(c) is the object of color c with the maximum weight is reported.
منابع مشابه
Range Searching in Categorical Data: Colored Range Searching on Grid
Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query as...
متن کاملData Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles) in R, d ≥ 1 such that given a query orthogonal range q, we can report efficiently for each distinct color c of the points in S∩q, the tuple < c,F(c) > where F(c) is a function (e.g. weighted sum, bounding box etc.) o...
متن کاملRange-Aggregate Queries Involving Geometric Aggregation Operations
In this paper we consider range-aggregate query problems wherein we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain aggregation function on the objects S′ = S ∩ q can be answered efficiently. Range-aggregate version of point enclosure queries, 1-d segment intersection, 2-d orthogonal segment intersection (with/without distance constraint) ar...
متن کاملData Structures for Range-Aggregation over Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles) in IR, d ≥ 1 such that given a query orthogonal range q (e.g. hyperbox/point), we can report efficiently for each distinct color c of the points in S ∩ q, the tuple 〈 c, F(c) 〉 where F(c) is a function (e.g. weighted...
متن کاملRange-Aggregate Queries for Geometric Extent Problems
Let S be a set of n points in the plane. We present data structures that solve range-aggregate query problems on three geometric extent measure problems. Using these data structures, we can report, for any axis-parallel query rectangle Q, the area/perimeter of the convex hull, the width, and the radius of the smallest enclosing disk of the points in S ∩Q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010